1763C - Another Array Problem - CodeForces Solution


brute force constructive algorithms greedy *2000

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<ll> x(n);
        ll sum = 0, mx = 0;
        for (int i = 0; i < n; i++) {
            cin >> x[i];
            sum += x[i];
            mx = max(mx, x[i]);
        }
        if (n == 2) {
            cout << max(sum, abs(x[0] - x[1]) * 2) << '\n';
            continue;
        }
        if (n == 3) {
            cout << max({sum, max(x[0], x[2]) * 3,abs(x[0]-x[1])*3,abs(x[2]-x[1])*3}) << '\n';
            continue;
        }
        ll ans = mx * n;
        cout << ans << '\n';
    }
}


Comments

Submit
0 Comments
More Questions

957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)